1684B - Z mod X = C - CodeForces Solution

constructive algorithms math *800

Please click on ads to support us..

Python Code: 

for i in range(int(input())):
    f,g,h = map(int,input().split())
    a = f+g+h
    b = g+h
    print(a,b,h)

C++ Code: 

#include <bits/stdc++.h>
using namespace std;
int main(){
long long t;
cin>>t;
while (t--)
{
long long a,b,c;
cin>>a>>b>>c;
long long x=(a+b+c)-((b+c)%b);
cout<<x<<" "<<b<<" "<<c<<endl;
}
}


Comments

Submit
0 Comments
More Questions

181A - Series of Crimes
1638A - Reverse
1654C - Alice and the Cake
369A - Valera and Plates
1626A - Equidistant Letters
977D - Divide by three multiply by two
1654B - Prefix Removals
1654A - Maximum Cake Tastiness
1649A - Game
139A - Petr and Book
1612A - Distance
520A - Pangram
124A - The number of positions
1041A - Heist
901A - Hashing Trees
1283A - Minutes Before the New Year
1654D - Potion Brewing Class
1107B - Digital root
25A - IQ test
785A - Anton and Polyhedrons
1542B - Plus and Multiply
306A - Candies
1651C - Fault-tolerant Network
870A - Search for Pretty Integers
1174A - Ehab Fails to Be Thanos
1169A - Circle Metro
780C - Andryusha and Colored Balloons
1153A - Serval and Bus
1487C - Minimum Ties
1136A - Nastya Is Reading a Book